On the Statistical Theory of Turbo-Codes
نویسنده
چکیده
A statistical theory of turbo-codes, treated as a special family of convolutional codes with a low-density parity-check matrix, is developed. The basic ideas are: the representation of the transposed parity-check matrix of turbo-codes as a product of a sparse (multiple) scrambler matrix and the transposed parity-check matrix of the basic code, the introduction of a special statistical ensemble of scramblers having Markov properties, and numerical analysis of the recurrent equations describing the average performance of turbo-codes over this ensemble.
منابع مشابه
An approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملNew Directions in Coding: From Statistical Physics to Quasigroup String Transformations
The last several years have witnessed major theoretical advances in communications and coding theory resulting in a new coding concept called codes on graphs. Codes on graphs, and specially their prime examples, low-density parity check (LDPC) codes and turbo codes is a research area of great current interest. In this paper we first overview the basic relation between codes on graph and spin sy...
متن کاملOn the Theory of Low-Density Convolutional Codes
Abstract – In this paper, which is the first part in a series of three, a formal theory and construction methods for low-density convolutional (LDC) codes (including turbo-codes) are presented. The principles of iterative decoding of LDC codes are formulated, and an iterative algorithm for decoding of homogeneous LDC codes is described. Some simulation results are also presented. In the followi...
متن کاملThe statistical mechanics of turbo codes
The “turbo codes”, recently proposed by Berrou et. al. [1] are written as a disordered spin Hamiltonian. It is shown that there is a threshold Θ such that for signal to noise ratios v2/w2 > Θ the error probability per bit vanishes in the thermodynamic limit, i.e. the limit of infinitly long sequences. The value of the threshold has been computed for two particular turbo codes. It is found that ...
متن کاملReview on Various Turbo Decoders in Networks
This survey paper presents various decoders for wireless sensor networks. Also reviewed many algorithms used for decoding purposes. Turbo codes have been recognized as a milestone in the channel coding theory. These are a class of error correcting codes that come closer to Shannon’s limit than any other class of error correcting codes. Due to their outstanding error-correcting capabilities, tur...
متن کامل